import java.util.Scanner;

/**
 * 13. 修剪灌木
 * https://www.lanqiao.cn/problems/2107/learning/?page=1&first_category_id=1&tags=2022,%E7%9C%81%E8%B5%9B&tag_relation=intersection&sort=pass_rate&asc=0
 */
public class Main13 {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        //在此输入您的代码...
        int n = scan.nextInt();
        for(int i=1;i<=n;i++) {
            int max = Math.max(i-1, n-i);//i-1该树到最左端的距离  n-i最右端
            System.out.println(max * 2);
        }
    }
}
